Statistical estimation algorithms for repairs-time limit replacement scheduling under earning rate criteria
نویسندگان
چکیده
منابع مشابه
Statistical estimation algorithms for repairs-time limit replacement scheduling under earning rate criteria
K e y w o r d s M a i n t e n a n c e , Repair-time limit, Imperfect repair, Earning rate, Lorenz statistics, Nonparametric. This research was partially supported by the Ministry Education, Culture, Sports, Science and Technology, Grantin-Aid for Exploratory Research; Grant No. 15651076 (2003-2005), Scientific Research (B); Grant No~ 16310116 (2004-2006), Scientific Research (C); Grant No. 1651...
متن کاملStatistical Rate Monotonic Scheduling
Statistical Rate Monotonic Scheduling (SRMS) is a generalization of the classical RMS results of Liu and Layland [10] for periodic tasks with highly variable execution times and statistical QoS requirements. The main tenet of SRMS is that the variability in task resource requirements could be smoothed through aggregation to yield guaranteed QoS. This aggregation is done over time for a given ta...
متن کاملImproved Scheduling Algorithms for Minsum Criteria
including environments with parallelizable jobs, jobs contending for shared resources, tree precedence-constrained jobs, as well as shop scheduling models. In several of these cases, we give the first constant performance guarantee achieved on-line. Finally, one of the consequences of our work is the surprising structural property that there are schedules that simultaneously approximate the opt...
متن کاملBi-criteria Scheduling on Parallel Machines Under Fuzzy Processing Time
Job scheduling is concerned with the optimal allocation of scare resources with objective of optimising one or several criteria. Job scheduling has been a fruitful area of research for many decades in which scheduling resolve both allocation of machines and order of processing. If the jobs are scheduled properly, not only the time is saved but also efficiency of system is increased. The paralle...
متن کامل3 Scheduling under Unavailability Constraints to Minimize Flow - time Criteria
In this chapter, we consider some practical scheduling problems under unavailability constraints (breakdown periods, maintenance durations and/or setup times). Such problems can be met in different industrial environments and be associated to numerous real-life applications. This explains why many researchers have become interested in this subject. We aim to present the recent approaches propos...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2006
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2005.11.004